A mixed min-max control problem governed by integral equations
نویسندگان
چکیده
منابع مشابه
A computational method for nonlinear mixed Volterra-Fredholm integral equations
In this article the nonlinear mixed Volterra-Fredholm integral equations are investigated by means of the modied three-dimensional block-pulse functions (M3D-BFs). This method converts the nonlinear mixed Volterra-Fredholm integral equations into a nonlinear system of algebraic equations. The illustrative examples are provided to demonstrate the applicability and simplicity of our scheme.
متن کاملA Posteriori Error Estimates of Mixed Methods for Quadratic Optimal Control Problems Governed by Parabolic Equations
In this paper, we discuss the a posteriori error estimates of the mixed finite element method for quadratic optimal control problems governed by linear parabolic equations. The state and the co-state are discretized by the high order Raviart-Thomas mixed finite element spaces and the control is approximated by piecewise constant functions. We derive a posteriori error estimates for both the sta...
متن کاملEquivalent a Posteriori Error Estimates for a Constrained Optimal Control Problem Governed by Parabolic Equations
For the optimal control problems governed by linear elliptic or parabolic state equations, a priori error estimates of the finite element approximation were established long ago, see [1, 2, 3, 4, 5]. In order to obtain a numerical solution of acceptable accuracy for the optimal control problem, the finite element meshes have to be refined according to a mesh refinement scheme. Adaptive finite e...
متن کاملThe Min-max Edge q-Coloring Problem
In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most q different colors, and (b) the maximum size of a colo...
متن کاملOn the max min vertex cover Problem
We address the max min vertex cover problem, which is the maximization version of the well studied min independent dominating set problem, known to be NP-hard and highly inapproximable in polynomial time. We present tight approximation results for this problem on general graphs, namely a polynomial approximation algorithm which guarantees an n approximation ratio, while showing that unless P = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1988
ISSN: 0898-1221
DOI: 10.1016/0898-1221(88)90196-4